全文获取类型
收费全文 | 17069篇 |
免费 | 3161篇 |
国内免费 | 2661篇 |
专业分类
电工技术 | 998篇 |
综合类 | 2116篇 |
化学工业 | 376篇 |
金属工艺 | 282篇 |
机械仪表 | 1296篇 |
建筑科学 | 288篇 |
矿业工程 | 311篇 |
能源动力 | 261篇 |
轻工业 | 268篇 |
水利工程 | 121篇 |
石油天然气 | 465篇 |
武器工业 | 256篇 |
无线电 | 3234篇 |
一般工业技术 | 1010篇 |
冶金工业 | 262篇 |
原子能技术 | 55篇 |
自动化技术 | 11292篇 |
出版年
2024年 | 117篇 |
2023年 | 476篇 |
2022年 | 811篇 |
2021年 | 770篇 |
2020年 | 642篇 |
2019年 | 543篇 |
2018年 | 541篇 |
2017年 | 672篇 |
2016年 | 732篇 |
2015年 | 889篇 |
2014年 | 1143篇 |
2013年 | 1095篇 |
2012年 | 1402篇 |
2011年 | 1370篇 |
2010年 | 1210篇 |
2009年 | 1253篇 |
2008年 | 1270篇 |
2007年 | 1271篇 |
2006年 | 1114篇 |
2005年 | 955篇 |
2004年 | 730篇 |
2003年 | 677篇 |
2002年 | 484篇 |
2001年 | 428篇 |
2000年 | 355篇 |
1999年 | 322篇 |
1998年 | 262篇 |
1997年 | 252篇 |
1996年 | 163篇 |
1995年 | 163篇 |
1994年 | 140篇 |
1993年 | 100篇 |
1992年 | 84篇 |
1991年 | 68篇 |
1990年 | 71篇 |
1989年 | 50篇 |
1988年 | 48篇 |
1987年 | 12篇 |
1986年 | 21篇 |
1985年 | 22篇 |
1984年 | 32篇 |
1983年 | 24篇 |
1982年 | 21篇 |
1981年 | 14篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 10篇 |
1977年 | 7篇 |
1976年 | 13篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 531 毫秒
941.
We present an explicit formula for the surface area of the (n,k)-star graph, i.e., the number of nodes at a certain distance from the identity node in the graph, by identifying the unique cycle structures associated with the nodes in the graph, deriving a distance expression in terms of such structures between the identity node of the graph and any other node, and enumerating those cycle structures satisfying the distance restriction.The above surface area derivation process can also be applied to some of the other node symmetric interconnection structures defined on the symmetric group, when the aforementioned distance expression is available. 相似文献
942.
Words that appear as constrained subsequences in a text-string are considered as possible indicators of the host string structure, hence also as a possible means of sequence comparison and classification. The constraint consists of imposing a bound on the number ω of positions in the text that may intervene between any two consecutive characters of a subsequence. A subset of such ω-sequences is then characterized that consists, in intuitive terms, of sequences that could not be enriched with more characters without losing some occurrence in the text. A compact spatial representation is then proposed for these representative sequences, within which a number of parameters can be defined and measured. In the final part of the paper, such parameters are empirically analyzed on a small collection of text-strings endowed with various degrees of structure. 相似文献
943.
In this paper, the robust fault detection filter design problem for linear time invariant (LTI) systems with unknown inputs and modeling uncertainties is studied. The basic idea of our study is to formulate the robust fault detection filter design as a H∞ model-matching problem. A solution of the optimal problem is then presented via a linear matrix inequality (LMI) formulation. The main results include the formulation of robust fault detection filter design problems, the derivation of a sufficient condition for the existence of a robust fault detection filter and construction of a robust fault detection filter based on the iterative of LMI algorithm. 相似文献
944.
Benchmarking Image Segmentation Algorithms 总被引:1,自引:0,他引:1
We present a thorough quantitative evaluation of four image segmentation algorithms on images from the Berkeley Segmentation
Database. The algorithms are evaluated using an efficient algorithm for computing precision and recall with regard to human
ground-truth boundaries. We test each segmentation method over a representative set of input parameters, and present tuning
curves that fully characterize algorithm performance over the complete image database. We complement the evaluation on the
BSD with segmentation results on synthetic images. The results reported here provide a useful benchmark for current and future
research efforts in image segmentation. 相似文献
945.
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In a graph,
merging two regions, separated by a set of vertices, is not straightforward. The perfect fusion graphs defined in J. Cousty
et al. (J. Math. Imaging Vis. 30:(1):87–104, 2008) verify all the basic properties required by region merging algorithms as used in image segmentation. Unfortunately, the
graphs which are the most frequently used in image analysis (namely, those induced by the direct and the indirect adjacency
relations) are not perfect fusion graphs. The perfect fusion grid, introduced in the above mentioned reference, is an adjacency
relation on ℤ
d
which can be used in image analysis, which indeed induces perfect fusion graphs and which is “between” the graphs induced
by the direct and the indirect adjacencies. One of the main results of this paper is that the perfect fusion grid is the only
such graph whatever the dimension d.
相似文献
Gilles BertrandEmail: |
946.
Mosaicing is connecting two or more images and making a new wide area image with no visible seam-lines. Several algorithms
have been proposed to construct mosaics from image sequence where the camera motion is more or less complex. Most of these
methods are based either on the interest points matching or on theoretical corner models. This paper describes a fully automated
image-mosaicing method based on the regions and the Harris points primitives. Indeed, in order to limit the search window
of potential homologous points, for each point of interest, regions segmentation and matching steps are being performed. This
enables us to improve the reliability and the robustness of the Harris points matching process by estimating the camera motion.
The main originality of the proposed system resides in the preliminary manipulation of regions matching, thus making it possible
to estimate the rotation, the translation and the scale factor between two successive images of the input sequence. This estimation
allows an initial alignment of the images along with the framing of the interest points search window, and therefore reducing
considerably the complexity of the interest points matching algorithm. Then, the resolution of a minimization problem, altogether
considering the couples of matched-points, permits us to perform the homography. In order to improve the mosaic continuity
around junctions, radiometric corrections are applied. The validity of the herewith described method is illustrated by being
tested on several sequences of complex and challenging images captured from real-world indoor and outdoor scenes. These simulations
proved the validity of the proposed method against camera motions, illumination variations, acquirement conditions, moving
objects and image noise. To determine the importance of the regions matching stage in motion estimation, as well as for the
framing of the search window associated to a point of interest, we compared the matching points results of this described
method with those produced using the zero-mean normalized cross correlation score (without regions matching). We made this
comparison in the case of a simple motion (without the presence of a rotation around optical axis and/or a scale factor),
in the case of a rotation and in the general case of an homothety. For justifying the effectiveness of this method, we proposed
an objective assessment by defining a reconstruction error.
相似文献
Slim AmriEmail: |
947.
点覆盖问题虽然可以在参数计算理论的架构内求精确解,但是目前在理论及应用上有一定的局限性.根据不同度的顶点之间及顶点与边的关系,提出随机图参数化点覆盖问题的d-核化可决策性及2度点三角形予图的计数方法;通过研究子图对顶点的共享关系,分析2度顶点核化过程中核及度分布演变的动态过程,得出随机图2度点核化强度与2度点概率关系及2度点核化可决策性的两个推论:2度点核化算法对2度点分布概率约为0.75的随机图的核化强度最高;对顶点度概率分布为φ(χ)的随机图的参数化点覆盖问题(G,k),当k小于某一与φ(х)有关的值时,它是2-核化可决策的.仿真结果证实,该理论能够把握2度点核化的内在机制,提供随机图上这一NP完全问题的求解方法,也为参数计算在已知度分布的一类不确定问题中的应用提供了可能. 相似文献
948.
面向无线传感器网络节点定位的移动锚节点路径规划 总被引:1,自引:0,他引:1
节点定位是无线传感器网络技术研究的一个基本问题,大多数无线传感器网络的应用和中间件技术都需要节点的位置信息.目前比较实用的定位方法是利用一些移动锚节点(如安装有GPS)根据有效的规划路径移动,通过发送包含其自身坐标的信息来定位其他节点,该方法不过多地增加无线传感器网络成本,还可以获得较高的定位精度.在该方法中,移动锚节点的路径规划问题是需要解决的基本问题.主要研究移动锚节点的路径规划问题,把图论引入到无线传感器网络节点定位系统.把无线传感器网络看成一个连通的节点无向图,路径规划问题转化为图的生成树及遍历问题,提出了宽度优先和回溯式贪婪算法.仿真实验和真实系统实验结果表明,该方法能够很好地适应无线传感器网络节点随机分布的节点定位,可以取得较高的定位精度. 相似文献
949.
在蛋白质序列的比对研究中,拥有相似模式的蛋白质常常具有相似的功能.通过已知的蛋白质序列模式可以很方便地对新蛋白质序列的功能结构进行研究和确认.蛋白质序列的发现已成为一个很有意义的题目.对基于模式驱动Pratt算法进行改进以提高其效率,在原来基础上引入模糊查询方法,能够更为快捷地从互不相关的蛋白质序列集合中找出最具代表性的蛋白质模式. 相似文献
950.
深层网数据库的访问方式主要是通过查询接口,所以查询接口是外部访问深层网数据库的门户.为了能够同时访问同一领域多个Web数据库,需要对多个Web数据库的查询接口进行集成.因此,提出基于本体的深层网查询接口集成方法.首先构建领域核心本体,在模式匹配过程中,不断完善核心本体;然后,以本体作为媒介,在不同查询接口模式间建立属性映射关系,发现属性间的语义关联;最后,根据本体概念出现的频数生成集成接口.实验表明提出的深层网查询接口自动集成方法是可行的和高效的. 相似文献